Locality and applications to subsumption testing and interpolation in $\mathcal{EL}$ and some of its extensions

In this paper we show that subsumption problems in lightweight description logics (such as E L and E L ) can be expressed as uniform word problems in classes of semilattices with monotone operators. We use possibilities of efficient local reasoning in such classes of algebras, to obtain uniform PTIME decision procedures for CBox subsumption in E L , E L + and extensions thereof. These locality considerations allow us to present a new family of (possibly many-sorted) logics which extend E L and E L + with n-ary roles and/or numerical domains. As a by-product, this allows us to show that the algebraic models of E L and E L + have ground interpolation and thus that E L , E L , and their extensions studied in this paper have interpolation. We also show how these ideas can be used for the description logic E L .